/*
 * @lc app=leetcode.cn id=36 lang=typescript
 *
 * [36] 有效的数独
 *
 * https://leetcode.cn/problems/valid-sudoku/description/
 *
 * algorithms
 * Medium (63.03%)
 * Likes:    1135
 * Dislikes: 0
 * Total Accepted:    386.3K
 * Total Submissions: 612.8K
 * Testcase Example:  '[["5","3",".",".","7",".",".",".","."],["6",".",".","1","9","5",".",".","."],[".","9","8",".",".",".",".","6","."],["8",".",".",".","6",".",".",".","3"],["4",".",".","8",".","3",".",".","1"],["7",".",".",".","2",".",".",".","6"],[".","6",".",".",".",".","2","8","."],[".",".",".","4","1","9",".",".","5"],[".",".",".",".","8",".",".","7","9"]]'
 *
 * 请你判断一个 9 x 9 的数独是否有效。只需要 根据以下规则 ，验证已经填入的数字是否有效即可。
 * 
 * 
 * 数字 1-9 在每一行只能出现一次。
 * 数字 1-9 在每一列只能出现一次。
 * 数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。（请参考示例图）
 * 
 * 
 * 
 * 
 * 注意：
 * 
 * 
 * 一个有效的数独（部分已被填充）不一定是可解的。
 * 只需要根据以上规则，验证已经填入的数字是否有效即可。
 * 空白格用 '.' 表示。
 * 
 * 
 * 
 * 
 * 示例 1：
 * 
 * 
 * 输入：board = 
 * [["5","3",".",".","7",".",".",".","."]
 * ,["6",".",".","1","9","5",".",".","."]
 * ,[".","9","8",".",".",".",".","6","."]
 * ,["8",".",".",".","6",".",".",".","3"]
 * ,["4",".",".","8",".","3",".",".","1"]
 * ,["7",".",".",".","2",".",".",".","6"]
 * ,[".","6",".",".",".",".","2","8","."]
 * ,[".",".",".","4","1","9",".",".","5"]
 * ,[".",".",".",".","8",".",".","7","9"]]
 * 输出：true
 * 
 * 
 * 示例 2：
 * 
 * 
 * 输入：board = 
 * [["8","3",".",".","7",".",".",".","."]
 * ,["6",".",".","1","9","5",".",".","."]
 * ,[".","9","8",".",".",".",".","6","."]
 * ,["8",".",".",".","6",".",".",".","3"]
 * ,["4",".",".","8",".","3",".",".","1"]
 * ,["7",".",".",".","2",".",".",".","6"]
 * ,[".","6",".",".",".",".","2","8","."]
 * ,[".",".",".","4","1","9",".",".","5"]
 * ,[".",".",".",".","8",".",".","7","9"]]
 * 输出：false
 * 解释：除了第一行的第一个数字从 5 改为 8 以外，空格内其他数字均与 示例1 相同。 但由于位于左上角的 3x3 宫内有两个 8 存在,
 * 因此这个数独是无效的。
 * 
 * 
 * 
 * 提示：
 * 
 * 
 * board.length == 9
 * board[i].length == 9
 * board[i][j] 是一位数字（1-9）或者 '.'
 * 
 * 
 */

// @lc code=start
function isValidSudoku(board: string[][]): boolean {
    const arr:Array<[number,number,number]>=[[0,1,2],[3,4,5],[6,7,8]],len:number=board.length
    const arr1:Array<number>=new Array(9),arr2:Array<number>=new Array(9)
    let k:number
    for(let i=0;i<len;i++){
        for(let j=0;j<len;j++){
            if(board[i][j]!='.'){
                k=Number.parseInt(board[i][j])-1
                if(!arr1[k])arr1[k]=1
                else return false
            }
            if(board[j][i]!='.'){
                k=Number.parseInt(board[j][i])-1
                if(!arr2[k])arr2[k]=1
                else return false
            }
        }
        arr1.length=0
        arr1.length=len
        arr2.length=0
        arr2.length=len
        
    }
    for(let i=0;i<3;i++){
        for(let j=0;j<3;j++){
            for(let m=0;m<3;m++){
                for(let n=0;n<3;n++){
                    if(board[arr[i][m]][arr[j][n]]!='.'){
                        k=Number.parseInt(board[arr[i][m]][arr[j][n]])-1
                        if(!arr1[k])arr1[k]=1
                        else return false
                    }
                }
            }
            arr1.length=0
            arr1.length=len
        }
    }
    return true
};
// @lc code=end

